Logic Programming from the Perspective of Algebraic Semantics
نویسنده
چکیده
We present an approach to foundations of logic programming in which the connection with algebraic semantics becomes apparent. The approach is based on omega-Herbrand models instead of conventional Herbrand models. We give a proof of Clark's theorem on completeness of SLD-resolution by methods of the algebraic semantics. We prove the existence property for deenite programs.
منابع مشابه
AN ALGEBRAIC STRUCTURE FOR INTUITIONISTIC FUZZY LOGIC
In this paper we extend the notion of degrees of membership and non-membership of intuitionistic fuzzy sets to lattices and introduce a residuated lattice with appropriate operations to serve as semantics of intuitionistic fuzzy logic. It would be a step forward to find an algebraic counterpart for intuitionistic fuzzy logic. We give the main properties of the operations defined and prove som...
متن کاملPredicate Introduction Under Stable and Well-Founded Semantics
This paper studies the tranformation of “predicate introduction”: replacing a complex formula in an existing logic program by a newly defined predicate. From a knowledge representation perspective, such transformations can be used to eliminate redundancy or to simplify a theory. From a more practical point of view, they can also be used to transform a theory into a normal form imposed by certai...
متن کاملPredicate Introduction for Logics with a Fixpoint Semantics. Part I: Logic Programming
We study the transformation of “predicate introduction” in non-monotonic logics. By this, we mean the act of replacing a complex formula by a newly defined predicate. From a knowledge representation perspective, such transformations can be used to eliminate redundancy or to simplify a theory. From a more practical point of view, they can also be used to transform a theory into a normal form imp...
متن کاملPredicate Introduction for Logics with Fixpoint Semantics. Part II: Autoepistemic Logic
We study the transformation of “predicate introduction” in non-monotonic logics. By this, we mean the act of replacing a complex formula by a newly defined predicate. From a knowledge representation perspective, such transformations can be used to eliminate redundancy or to simplify a theory. From a more practical point of view, they can also be used to transform a theory into a normal form imp...
متن کاملJ. Logic Programming 1995:25, 3:191{248 Generalized Semantics Andabstract Interpretation for Constraint Logic Programs
We present a simple and powerful generalized algebraic semantics for constraint logic programs that is parameterized with respect to the underlying constraint system. The idea is to abstract away from standard semantic objects by focusing on the general properties of any|possibly non-standard| semantic deenition. In constraint logic programming, this corresponds to a suitable deenition of the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 28 شماره
صفحات -
تاریخ انتشار 1996